A Good Hash Function is Hard to Find, and Vice Versa

نویسنده

  • Joshua Holden
چکیده

Secure hash functions are the unsung heroes of modern cryptography. Introductory courses in cryptography often leave them out — since they don’t have a secret key, it is difficult to use hash functions by themselves for cryptography. In addition, most theoretical discussions of cryptographic systems can get by without mentioning them. However, for secure practical implementations of public-key ciphers, digital signatures, and many other systems they are indispensable. In this paper I will discuss the requirements for a secure hash function and relate my attempts to come up with a “toy” system which both reasonably secure and also suitable for students to work with by hand in a classroom setting.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)

Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...

متن کامل

An Improved Hash Function Based on the Tillich-Zémor Hash Function

Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.

متن کامل

Data-Depend Hash Algorithm

Hash algorithm is the algorithm that computes a fixed size message digest from arbitrary size messages. After SHA-0 was published, some technologys that analyse and attack hash algorithm is developed. The major technologys is Differential attack. Papers[Wy05, Dau05] has explain the attack. Differential attack is the best technique to attack hash function. To attack hash function, it need do the...

متن کامل

Analysis of Multi-Robots Transportation with Multi-objective PSO Algorithm in an Artificial Capital Market

In this paper, to analyze the transport of autonomous robots, an artificial Capital market is used. Capital market is considered as a pier which loading and unloading of cargo is done. Autonomous robots load and unload from the ship to the warehouse wharf or vice versa. All the robots have the ability of transporting the loads, but depending on loads and the location of unloading (or loading) a...

متن کامل

Cs 388h Introduction to Cryptography Lecture 1: Class Introduction 2 Foundations of Cryptography

1 Class Overview This course reviews the foundations of Cryptography and will cover topics such as formal notions of security, encryption, signatures, complexity assumptions, zero knowledge, and multi-party computation. Most of the material will be based on " Introduction to Modern Cryptography " by Katz and Lindell. " Foundations of Cryptography: Volume I " is optional and more theoretical. Se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Cryptologia

دوره 37  شماره 

صفحات  -

تاریخ انتشار 2013